earliest due date中文是什么意思

• 最早定单完成日期
• 最早订单完成日期
• 最早支付日期

• "early"中文翻译    adj. 1.早；(果实等)早熟的。 2.早日的，及早的 ...
• "due date"中文翻译    (借据等的)到期日，应付款日期。
• "earliest diagnosed date" 中文翻译 :    最早诊断日期
• "earliest expected date" 中文翻译 :    最早预计日期; 最早预期日期
• "earliest feasible date" 中文翻译 :    最早可行日期
• "earliest start date" 中文翻译 :    最早开工日
• "epd earliest possible date" 中文翻译 :    最早可能日期
• "date due" 中文翻译 :    到期日; 截止日期; 履约日; 满期
• "due date" 中文翻译 :    (借据等的)到期日，应付款日期。
• "approximate due date" 中文翻译 :    大约满期日期; 估计期间
• "average due date" 中文翻译 :    平均到期日; 平均支付期
• "date due calving" 中文翻译 :    母牛预产期
• "day of due date" 中文翻译 :    到期日, 满期日
• "day of maturity; due date" 中文翻译 :    到期日
• "display due date length" 中文翻译 :    显示期限长度
• "due calving date" 中文翻译 :    母牛预产期
• "due date for payment" 中文翻译 :    应付款的日期；付款到期日
• "due date for payments" 中文翻译 :    付款限期
• "due date limit" 中文翻译 :    到期日极限
• "due date of coupon" 中文翻译 :    息票到期日
• "due date rule" 中文翻译 :    交货期规划
• "due end date" 中文翻译 :    应付止期
• "due start date" 中文翻译 :    应付起期
• "estimated due date" 中文翻译 :    估计到期日
• "next due date" 中文翻译 :    下次到期日

• Table that have the earliest due dates
  表中删除了其到期日期最早的10行。
• Earliest due date
  最早订单完成日期
• Recent works , such as jitter earliest due date queueing ( jedd ) and multilayer - gated frame queueing ( mgfq ) tries to achieve the goal in the intermediate nodes
  近期的研究则尝试在传送路径之中间点（路由器、交换器）上达成目标。
• The main idea of this hybrid algorithm is : at first , all candidates in task collection is lined according to a dispatching rule ( earliest due date , edd ) , then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier , many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier , the allocation of the resources over time is conducted to perform every feasible task sequence , and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed
  该算法按照最早完工时间优先( ect )分派规则,先将参加排序的工序合并成一个串行序列,然后按照同层内不存在偏序关系的原则,将其分解为若干个时间上相互衔接的层次,在每个层次内部,通过构造邻域产生出多个可行序列,对每个可行序列进行设备配置,采用邻域搜索算法进行方案的寻优,保留一组满足评价要求的可行方案作为下一层设备配置的背景环境,通过层层递进最终获取全局的近似最优解。